On Vosperian and Superconnected Vertex-Transitive Digraphs

نویسندگان

  • Yahya Ould Hamidoune
  • Anna S. Lladó
  • Susana-Clara López
چکیده

We investigate the structure of a digraph having a transitive automorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We improve most of the existing results in this area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximally connected and superconnected digraphs

A maximally connected digraph is said to be superconnected if every minimum disconnecting set F of vertices is trivial, i.e., it consists of the vertices adjacent to or from a given vertex not belonging to F . In this work, it is shown that a digraph is maximally connected provided that a certain condition on the diameter holds, and superconnected under a more restrictive constraint. These cond...

متن کامل

Using a progressive withdrawal procedure to study superconnectivity in digraphs

A maximally connected digraph is said to be superconnected if every minimum disconnecting set F of vertices is trivial, i.e., it consists of the vertices adjacent to or from a given vertex not belonging to F . This work is devoted to presenting a sufficient condition — in terms of the so called parameter ` — on the diameter, in order to guarantee that the digraph is superconnected, giving also ...

متن کامل

Vertex-Transitive Digraphs of Order $p^5$ are Hamiltonian

We prove that connected vertex-transitive digraphs of order p5 (where p is a prime) are Hamiltonian, and a connected digraph whose automorphism group contains a finite vertex-transitive subgroup G of prime power order such that G′ is generated by two elements or elementary abelian is Hamiltonian.

متن کامل

Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms

A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to [6] where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. It was observed there that every vertex-transitive digraph of order pk or mp, where p is a prime, k 1 and m p are positive integers, has a sem...

متن کامل

Some Non-Normal Cayley Digraphs of the Generalized Quaternion Group of Certain Orders

We show that an action of SL(2, p), p ≥ 7 an odd prime such that 4 6 | (p − 1), has exactly two orbital digraphs Γ1, Γ2, such that Aut(Γi) admits a complete block system B of p + 1 blocks of size 2, i = 1, 2, with the following properties: the action of Aut(Γi) on the blocks of B is nonsolvable, doubly-transitive, but not a symmetric group, and the subgroup of Aut(Γi) that fixes each block of B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2013